Metrics and management for flash memory storage life

ABSTRACT

According to one aspect of the invention, a method of evaluating reliability of flash memory media comprises managing a flash memory remaining life for each disk of a plurality of flash memory media disks provided in one or more flash memory media groups each of which has a configuration and a relationship between said each flash memory media group and the flash memory media disks in said each flash memory media group, wherein each flash memory media group is one of a RAID group or a thin provisioning pool; and calculating to obtain information of each flash memory media group based on the measured flash memory remaining life for each disk in said each flash memory media group, the configuration of said each flash memory media group, and the relationship between said each flash memory media group and the flash memory media disks in said each flash memory media group.

This application is a continuation of U.S. patent application Ser. No.12/385,232, filed Apr. 2, 2009, now allowed, the entire content of whichis incorporated herein by reference.

BACKGROUND OF THE INVENTION

The present invention relates generally to a method and a system for themanagement of availability and reliability of flash memory media.

For flash memory media, examples of metrics for life time include MTBF(Mean Time Between Failures), MTTF (Mean Time To Failure), and LDE(Long-term Data Endurance). MTBF is a general metric for HDDavailability/reliability, and represents a statistic HDD life time. MTTFis a general metric for RAID group availability, and it represents astatistic RAID group life time. LDE is a metric that represents how muchcapacity the media can be written. An example of storage control forhigh availability/reliability is RAID (Redundant Array of IndependentDisks). RAID 10 has 4 or more disks and stores double data. RAID 5 has 3or more disks and stores data and parity data. The parity data isgenerated from the data. This optimized control method is described inU.S. Pat. No. 5,682,396. RAID 6 has 4 or more disks and stores data anddouble-parity data. The double-parity data are generated from the data.

Generally, the life of an HDD (Hard Disk Drive) is dominated by itsrunning time, because an HDD medium has mechanical units (heads,platters and motors). However, the life of a flash memory medium isdominated by the number of times it is written (erase operation) since,when the erase operation occurs, the flash memory medium applies a highvoltage to reset the data. This erase operation can cause damage.Meanwhile especially in the enterprise environment, the use of flashmemory media for storage systems is required for its high transactionand throughput performance. It is important for these environments thatthe use of flash memory media not to be stopped due to failure.

BRIEF SUMMARY OF THE INVENTION

Exemplary embodiments of the invention provide a method and a system forthe management of availability and reliability of flash memory mediaand, more particularly, a way to predict flash memory failure caused bythe erase operation and to protect against such failure. In oneembodiment, the storage system manages the configurations of flashmemory media groups (RAID group or thin provisioning pools), measuresthe flash memory remaining life of each disk of the flash memory mediaby counting the erase (write) operation number of times or getting theinformation from the flash memory media, measures the each ratio ofwrite I/O types (sequential/random), calculates the remaining life ofeach of the flash memory media groups by using the remaining life offlash memory media, the configuration of the flash memory media groups(redundancy characteristics), and the ratio of write I/O types, andreports the calculated remaining life time of the flash memory mediagroups. The flash memory media units are referred to as disks forconvenience. The term “disk” is not intended to limit the physicalstructure of the flash memory media unit, but encompasses any flashmemory configuration.

In accordance with an aspect of the present invention, a method ofevaluating reliability of flash memory media comprises measuring a flashmemory remaining life for each disk of a plurality of flash memory mediadisks provided in one or more flash memory media groups each of whichhas a configuration, wherein each flash memory media group is one of aRAID group or a thin provisioning pool; obtaining a ratio of sequentialto random write I/O types for each flash memory media group; andcalculating a remaining life of each flash memory media group based onthe measured flash memory remaining life for each disk in said eachflash memory media group, the configuration of said each flash memorymedia group, and the ratio of sequential to random write I/O types forsaid each flash memory media group.

In some embodiments, measuring the flash memory remaining life for adisk comprises one of counting a number of sequential write operationsand a number of random write operations to the disk or obtaining theflash memory remaining life from a sequential write counter and a randomwrite counter in the disk.

In some embodiments, measuring the flash memory remaining life for adisk comprises obtaining the flash memory remaining life from asequential write counter and a random write counter in the disk. Thecalculating comprises calculating the remaining life of a RAID group ofdisks E as follows:

E=ρE _(p/Seq)+(1−ρ)E _(p/Rnd)

where

E _(RAID10/Seq)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID10/Rnd)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID5/Seq)=(N−1)min(λ_(i=[0,N−1)]),

E _(RAID5/Rnd)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID6/Seq)=(N−2)min(λ_(i=[0,N−1)]),

E _(RAID6/Rnd)=(N/3)min(λ_(i=[0,N−1)]),

p is a RAID level of the RAID group of disks,

Seq is sequential write I/O type,

Rnd is random write I/O type,

E_(p/Seq) is a write I/O endurance of the RAID group at RAID level p insequential write I/O type,

E_(p/Rnd) is a write I/O endurance of the RAID group at RAID level p inrandom write I/O type,

i is an ID of a disk and i is an integer, 0≦i≦N−1,

N is a number of disks in the RAID group,

λ_(i) is a remaining life of disk i, and

ρ is a ratio of sequential to random write I/O type, 0≦p≦1.

In specific embodiments, the plurality of flash memory media disks areprovided in one or more thin provisioning pools each having a pluralityof RAID groups of disks. The calculating comprises calculating theremaining life of each thin provisioning pool E_(Thin Prov) as follows

E _(Thin Prov)=Σ^(M−1) _(j=0) E _(j)

where

j is an ID of a RAID group of disks in the thin provisioning pool,

E_(j) is a remaining life of the RAID group j using E=ρ E_(p/Seq)+(1−ρ)E_(p/Rnd), and

M is the number of RAID groups in the thin provisioning pool.

In some embodiments, the measuring the flash memory remaining life for adisk comprises counting a number of sequential write operations and anumber of random write operations to the disk. The calculating comprisescalculating the remaining life of a RAID group of disks E as follows:

E=ρE _(p/Seq)+(1−ρ)E _(p/Rnd)

where

E _(RAID10/Seq)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID10/Rnd)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID5/Seq)=(N−1)min(λ_(i=[0,N−1)]),

E _(RAID5/Rnd)=(N/2)min(λ_(i=[0,N−1)]),

E _(RAID6/Seq)=(N−2)min(λ_(i=[0,N−1)]),

E _(RAID6/Rnd)=(N/3)min(λ_(i=[0,N-1)]),

p is a RAID level of the RAID group of disks,

Seq is sequential write I/O type,

Rnd is random write I/O type,

E_(p/Seq) is a write I/O endurance of the RAID group in sequential writeI/O type,

E_(p/Rnd) is a write I/O endurance of the RAID group in random write I/Otype,

i is an ID of a disk and i is an integer, 0≦i≦N−1,

N is a number of disks in the RAID group,

ρ is a ratio of sequential to random write I/O type, 0≦ρ≦1,

λ_(i) is a remaining life of disk i, and λ_(i)=L_(i)−I_(i),

L_(i) is a theoretical limit of a number of write times to disk i, and

I_(i) is one of the number of sequential write operations for disk i tobe used for calculating the write I/O endurance in sequential write I/Otype, or the number of random write operations for disk i to be used forcalculating the write I/O endurance in random write I/O type.

In some embodiments, the plurality of flash memory media disks areprovided in one or more thin provisioning pools each having a pluralityof disks. The calculating comprises calculating the remaining life ofthe thin provisioning pool E_(Thin Prov) as follows

E_(Thin Prov)=(½)Σ^(P) _(i=1)(λ_(i))

where

i is an ID of a disk,

λ_(i) is a remaining life of disk i, and

P is the number of disks in the thin provisioning pool.

In accordance with another aspect of the invention, a system ofevaluating reliability of flash memory media comprises a plurality offlash memory media disks which are provided in one or more flash memorymedia groups each of which has a configuration, wherein each flashmemory media group is one of a RAID group or a thin provisioning pool; amemory storing data and one or more modules; a processor executing theone or more modules to measure a flash memory remaining life for eachdisk of the plurality of flash memory media disks; obtain a ratio ofsequential to random write I/O types for each flash memory media group;and calculate a remaining life of each flash memory media group based onthe measured flash memory remaining life for each disk in said eachflash memory media group, the configuration of said each flash memorymedia group, and the ratio of sequential to random write I/O types forsaid each flash memory media group.

Another aspect of the invention is directed to a computer-readablestorage medium storing a plurality of instructions for controlling adata processor to evaluate reliability of flash memory media. Theplurality of instructions comprises instructions that cause the dataprocessor to measure a flash memory remaining life for each disk of aplurality of flash memory media disks provided in one or more flashmemory media groups each of which has a configuration, wherein eachflash memory media group is one of a RAID group or a thin provisioningpool; instructions that cause the data processor to obtain a ratio ofsequential to random write I/O types for each flash memory media group;and instructions that cause the data processor to calculate a remaininglife of each flash memory media group based on the measured flash memoryremaining life for each disk in said each flash memory media group, theconfiguration of said each flash memory media group, and the ratio ofsequential to random write I/O types for said each flash memory mediagroup.

These and other features and advantages of the present invention willbecome apparent to those of ordinary skill in the art in view of thefollowing detailed description of the specific embodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example of a hardware configuration of a computersystem in which the method and apparatus of the invention may beapplied.

FIG. 2 shows an example of the memory in the storage subsystem accordingto a first embodiment of the invention.

FIG. 3 shows an example of a RAID Group Management Table according tothe first embodiment.

FIG. 4 shows an example of a Virtual Volume Management Table accordingto the first embodiment.

FIG. 5 shows an example of a Disk Management Table according to thefirst embodiment.

FIG. 6 shows an example of a Cache Management Table.

FIG. 7 shows an exemplary logical structure illustrating a relationbetween the virtual volume and the disk.

FIG. 8 shows an example of a table reference structure for the CacheManagement Table.

FIG. 9 shows an example of a process flow diagram of the Write I/OControl.

FIG. 10 shows an example of a process flow diagram for the Read I/OControl.

FIG. 11 is an example of a process flow diagram for the Staging Control.

FIG. 12 is an example of a process flow diagram for the DestagingControl according to the first embodiment.

FIG. 13 is an example of a process flow diagram for the Flush Control.

FIG. 14 is an example of a process flow diagram for the Cache Control.

FIG. 15 is an example of a process flow diagram for the ReliabilityManagement Control.

FIG. 16 shows an example of a sequence chart of the sequential or randomwrite I/O to RAID 1 or 10 volume.

FIG. 17 shows an example of a sequence chart of random write I/O to RAID5 volume.

FIG. 18 shows an example of a sequence chart of random write I/O to RAID6 volume.

FIG. 19 shows an example of a sequence chart of random write I/O to RAID6 volume.

FIG. 20 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the first embodiment.

FIG. 21 shows an example of the output image on the display.

FIG. 22 shows an example of a sequence chart to check the reliabilityand replace a disk according to the first embodiment.

FIG. 23 shows an example of a Disk Management Table according to asecond embodiment of the invention.

FIG. 24 shows an example of a process flow diagram for the DestagingControl according to the second embodiment.

FIG. 25 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the second embodiment.

FIG. 26 shows an example of a sequence chart to check the reliabilityand replace a disk according to the second embodiment.

FIG. 27 shows an example of the memory in the storage subsystemaccording to a third embodiment of the invention.

FIG. 28 shows an example of a RAID Group Management Table according tothe third embodiment.

FIG. 29 shows an example of a Virtual Volume Management Table accordingto the third embodiment.

FIG. 30 shows an example of a Virtual Volume Page Management Table.

FIG. 31 shows an example of a Capacity Pool Chunk Management Table.

FIG. 32 shows an example of a Capacity Pool Page Management Table.

FIG. 33 shows an example of the virtual volume and its table structureaccording to the third embodiment.

FIG. 34 shows an example of the table reference structure toward thecapacity pool according to the third embodiment.

FIGS. 35 and 36 show an example of the process flow diagram for theDestaging Control according to the third embodiment.

FIG. 37 shows an example of the process flow diagram for the PageMigration Control.

FIG. 38 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the third embodiment.

FIG. 39 shows an example of the memory in the storage subsystemaccording to a fourth embodiment of the invention.

FIG. 40 shows an example of a Disk Management Table according to thefourth embodiment.

FIG. 41 shows an example of a Virtual Volume Management Table accordingto the fourth embodiment.

FIG. 42 shows an example of a Virtual Volume Page Management Tableaccording to the fourth embodiment.

FIG. 43 shows an example of the virtual volume and its table structureaccording to the fourth embodiment.

FIG. 44 shows an example of the table reference structure toward thecapacity pool according to the fourth embodiment.

FIG. 45 shows an example of an expression to calculate the reliabilityat step according to the fourth embodiment.

DETAILED DESCRIPTION OF THE INVENTION

In the following detailed description of the invention, reference ismade to the accompanying drawings which form a part of the disclosure,and in which are shown by way of illustration, and not of limitation,exemplary embodiments by which the invention may be practiced. In thedrawings, like numerals describe substantially similar componentsthroughout the several views. Further, it should be noted that while thedetailed description provides various exemplary embodiments, asdescribed below and as illustrated in the drawings, the presentinvention is not limited to the embodiments described and illustratedherein, but can extend to other embodiments, as would be known or aswould become known to those skilled in the art. Reference in thespecification to “one embodiment”, “this embodiment”, or “theseembodiments” means that a particular feature, structure, orcharacteristic described in connection with the embodiment is includedin at least one embodiment of the invention, and the appearances ofthese phrases in various places in the specification are not necessarilyall referring to the same embodiment. Additionally, in the followingdetailed description, numerous specific details are set forth in orderto provide a thorough understanding of the present invention. However,it will be apparent to one of ordinary skill in the art that thesespecific details may not all be needed to practice the presentinvention. In other circumstances, well-known structures, materials,circuits, processes and interfaces have not been described in detail,and/or may be illustrated in block diagram form, so as to notunnecessarily obscure the present invention.

Furthermore, some portions of the detailed description that follow arepresented in terms of algorithms and symbolic representations ofoperations within a computer. These algorithmic descriptions andsymbolic representations are the means used by those skilled in the dataprocessing arts to most effectively convey the essence of theirinnovations to others skilled in the art. An algorithm is a series ofdefined steps leading to a desired end state or result. In the presentinvention, the steps carried out require physical manipulations oftangible quantities for achieving a tangible result. Usually, though notnecessarily, these quantities take the form of electrical or magneticsignals or instructions capable of being stored, transferred, combined,compared, and otherwise manipulated. It has proven convenient at times,principally for reasons of common usage, to refer to these signals asbits, values, elements, symbols, characters, terms, numbers,instructions, or the like. It should be borne in mind, however, that allof these and similar terms are to be associated with the appropriatephysical quantities and are merely convenient labels applied to thesequantities. Unless specifically stated otherwise, as apparent from thefollowing discussion, it is appreciated that throughout the description,discussions utilizing terms such as “processing”, “computing”,“calculating”, “determining”, “displaying”, or the like, can include theactions and processes of a computer system or other informationprocessing device that manipulates and transforms data represented asphysical (electronic) quantities within the computer system's registersand memories into other data similarly represented as physicalquantities within the computer system's memories or registers or otherinformation storage, transmission or display devices.

The present invention also relates to an apparatus for performing theoperations herein. This apparatus may be specially constructed for therequired purposes, or it may include one or more general-purposecomputers selectively activated or reconfigured by one or more computerprograms. Such computer programs may be stored in a computer-readablestorage medium, such as, but not limited to optical disks, magneticdisks, read-only memories, random access memories, solid state devicesand drives, or any other types of media suitable for storing electronicinformation. The algorithms and displays presented herein are notinherently related to any particular computer or other apparatus.Various general-purpose systems may be used with programs and modules inaccordance with the teachings herein, or it may prove convenient toconstruct a more specialized apparatus to perform desired method steps.In addition, the present invention is not described with reference toany particular programming language. It will be appreciated that avariety of programming languages may be used to implement the teachingsof the invention as described herein. The instructions of theprogramming language(s) may be executed by one or more processingdevices, e.g., central processing units (CPUs), processors, orcontrollers.

Exemplary embodiments of the invention, as will be described in greaterdetail below, provide apparatuses, methods and computer programs forpredicting flash memory failure caused by the erase operation andprotecting against such failure.

First Embodiment

FIG. 1 illustrates an example of a hardware configuration of a computersystem in which the method and apparatus of the invention may beapplied. A storage subsystem 100 has a storage controller 110 thatincludes a CPU 111, a memory 112, a storage interface 113, a localnetwork interface 114, and disk interfaces 115 a-115 d. The CPU 111controls the storage subsystem 100, and reads programs and tables fromthe memory 112. The memory 112 stores the programs and tables. Thestorage interface 113 connects with a host computer 300 via a storagenetwork 200. The local network interface 114 connects with a storagemanagement terminal 400. The disk interfaces 115 a-115 d connect with aplurality of disks 121 a-121 d which are stored in a disk unit 120. Thedisks 121 include flash memory for storing data. The storage network 200connects the storage subsystem 100 and the host computer 300. The hostcomputer 300 sends I/O requests to the storage subsystem 100 via thestorage network 200, and sends data to and receives data from thestorage subsystem 100 via the storage network 200. The storagemanagement terminal 400 shows the availability/reliability informationof the storage subsystem 100. The terminal 400 includes a CPU 411 whichreads programs and tables stored in a memory 412. The local networkinterface 414 connects with the storage subsystem 100. A display 419displays the availability/reliability information of the storagesubsystem 100.

Hardware

FIG. 2 shows an example of the memory 112 in the storage subsystem 100according to a first embodiment of the invention. The memory 112includes a Volume Management Table 112-11 having a RAID Group ManagementTable 112-11-1 for the physical structure management of the disks 121and those groups, a Virtual Volume Management Table 112-11-2 for thevolume configuration management, and a Disk Management Table 112-11-3.The memory 112 further includes a Cache Management Table 112-14 formanaging a Cache Data Area 112-30 and LRU/MRU (most recently used/leastrecently used) management. A Volume I/O Control 112-21 includes a WriteI/O Control 112-21-1 that runs by a write I/O requirement and receiveswrite data and stores it to the Cache Data Area 112-30 via the channelinterface 113, and a Read I/O Control 112-21-2 that runs by a read I/Orequirement and sends read data from the Cache Data Area 112-30 via thechannel interface 113. A Physical Disk Control 112-22 includes a StagingControl 112-22-1 that transfers data from the disks 121 to the CacheData Area 112-30, and a Destaging Control 112-22-2 that transfers datafrom the Cache Data Area 112-30 to the disks 121. A Flush Control 112-23periodically flushes dirty data in the Cache Data Area 112-30 to thedisks 121. A Cache Control 112-24 finds cached data in the Cache DataArea 112-30, and allocates a new cache area in the Cache Data Area112-30. A Reliability Management Control 112-29 calculates reliabilitiesabout each of the RAID groups or thin provisioning pools by itsconfiguration and disk information, and reports the reliabilityinformation to the storage management terminal 400. A Kernel 112-40controls the schedules of running program. The Cache Data Area 112-30stores read and write cache data, and are separated into a plurality ofcache slots.

FIG. 3 shows an example of the RAID Group Management Table 112-11-1according to the first embodiment. The table lists the RAID Group Number112-11-1-1 representing the ID of the RAID group, and the RAID Level112-11-1-2 representing the structure of RAID group. The “N(=10, 5, 6,etc)” means “RAID Level is N.” “N/A” means the RAID Group does notexist. The table further lists the Disk Number 112-11-1-3 representingthe ID list of disks 121 belonging to the RAID group, and the RAID GroupCapacity 112-11-1-4 representing the total capacity of the RAID groupexcept the redundant area.

FIG. 4 shows an example of the Virtual Volume Management Table 112-11-2according to the first embodiment. The table lists the Volume Number112-11-2-1 representing the ID of the volume, and the Volume Capacity112-11-2-2 representing the capacity of the volume. “N/A” means thevolume does not exist. The table further lists the using RAID GroupNumber 112-11-2-3 representing the RAID Group ID that the volumecurrently uses, the Top Address Number 112-11-2-4 representing the topaddress that the volume uses in the RAID group, the Sequential WriteCounter 112-11-2-6 representing a counter of the sequential write I/O tothe volume, and the Random Write Counter 112-11-2-7 representing acounter of the random write I/O to the volume.

FIG. 5 shows an example of the Disk Management Table 112-11-3 accordingto the first embodiment. The table lists the Disk Number 112-11-3-1representing the ID of the disk, and the Disk Capacity 112-11-3-2representing the capacity of the disk.

FIG. 6 shows an example of the Cache Management Table 112-14. The tablelists the Cache Slot Number (Index) 112-14-1 representing the ID of thecache slot in the Cache Data Area 112-30, the Volume Number 112-14-2representing the ID of the virtual volume 141 to which the cache slotbelongs, the Virtual Volume Address (Logical Block Address or LBA)112-14-3 relating to the cache slot, and the Next Slot Pointer 112-14-4representing the next cache slot number for queue management. “NULL”means a terminal of the queue. The table further lists the Kind of QueueInformation 112-14-5 representing the kind of cache slot queue. “Free”means a queue that has the unused cache slots. “Clean” means a queuethat has cache slots that store the same data as the disk slots. “Dirty”means a queue that has cache slots that store different data from thedisk slots, so that the storage controller 110 needs to flush the cacheslot data to the disk slot in the future. The Queue Index Pointer112-14-6 in the table represents the index of the cache slot queue.

Logical Structure

FIG. 7 shows an exemplary logical structure illustrating a relationbetween the virtual volume 141 and the disks 121. The solid arrowedlines each refer to an object by calculation. For the virtual volumeslots 141-3, the virtual volume 141 is divided into a plurality ofvirtual volume slots 141-3, and each virtual volume slot 141-3 relatesto a disk slot 121-3. For the disk slots 121-3, each disk 121 is dividedinto a plurality of disk slots 121-3, and each disk slot 121-3 relatesto a virtual volume slot 141-3 except the parity data area.

FIG. 8 shows an example of a table reference structure for the CacheManagement Table 112-14. The arrowed lines include dashed lines andsolid lines. A dashed line refers to an object by pointer. A solid linerefers to an object by calculation. The Cache Data Area 112-30 isdivided into a plurality of cache slots 112-30-1. The size of a cacheslot 112-30-1 equals to the size of a capacity pool stripe 121-3 and tothe size of a virtual volume slot 141-3. The Cache Management Table112-18 and the cache slot 112-30-1 are on a one-to-one relation. Whenthe Cache Management Table 112-18 refers to a virtual volume slot 141-3,it can resolve the capacity pool stripe 121-3 by referring to the RAIDGroup Management Table 112-11-1.

Program Flow

FIG. 9 shows an example of a process flow diagram of the Write I/OControl 112-21-1, starting at step 112-21-1-1. In step 112-21-1-2, theprogram calls the Cache Control 112-24 to search for a cache slot112-30-1. In step 112-21-1-3, the program receives the write I/O datafrom the host computer 300 and stores the data to the aforesaid cacheslot 112-30-1. In step 112-21-1-4, the program checks the write I/O type(sequential or random) by the previous write I/O address. If the writeI/O is sequential, the program counts up the Sequential Write Counter112-11-2-6. If the write I/O is random, the program counts up the RandomWrite Counter 112-11-2-7. The process ends at step 112-21-1-5.

FIG. 10 shows an example of a process flow diagram for the Read I/OControl 112-21-2, starting at step 112-21-2-1. In step 112-21-2-2, theprogram calls the Cache Control 112-24 to search for a cache slot112-30-1. In step 112-21-2-3, the program checks the status of theaforesaid cache slot 112-30-1 as to whether the data has already beenstored there or not. If no, in step 112-21-2-4, the program calls theStaging Control 112-22-1. If yes, in 112-21-2-5, the program transfersthe data of the cache slot 112-30-1 to the host computer 300. Theprocess ends at step 112-21-2-6.

FIG. 11 is an example of a process flow diagram for the Staging Control112-22-1 starting at step 112-22-1-1. In step 112-22-1-3, the programreads data from a slot in the disk 121 and stores the data to the CacheData Area 112-30. In step 112-22-1-4, the program waits for the datatransfer to end. The process ends at step 112-22-1-5.

FIG. 12 is an example of a process flow diagram for the DestagingControl 112-22-2 according to the first embodiment, starting at step112-22-2-1. In step 112-22-2-3, the program reads data from the CacheData Area 112-30 and stores the data to a slot in a disk 121. In step112-22-2-4, the program checks the RAID level to which the slot belongs.If the RAID level is RAID 0, 1, or 10, the program skips to step112-22-2-8. If the RAID level is RAID 5 or 6, in step 112-22-2-5, theprogram checks whether there are data of the other slots belonging tothe same parity row in the Cache Data Area 112-30, and determineswhether it needs to perform a read-modify-write for the parity slot(s).If yes, in step 112-22-2-6 (case involving cache miss), the programstages the parity slot data from the disk 121. If no, the program skipsstep 112-22-2-6. In step 112-22-2-7, the program generates new paritydata. If there is no need to do read-modify-write (no in step112-22-2-5), the program calculates the new parity data based on thewritten data stored in the cache data area 112-30. If there is a need todo read-modify-write (yes in step 112-22-2-5), the program calculatesthe new parity data based on the written data stored in the cache dataarea 112-30 and the current parity data stored at step 112-22-2-6. Instep 112-22-2-8, the program waits for the data transfer to end.

FIG. 13 is an example of a process flow diagram for the Flush Control112-23, starting at step 112-23-1. In step 112-23-2, the program reads“Dirty Queue” of the Cache Management Table 112-14. If there is a dirtycache area, in step 112-23-3, the program calls the Destaging Control112-22-2 for the found dirty cache slot 112-30-1. If no, the programends at step 112-23-4.

FIG. 14 is an example of a process flow diagram for the Cache Control112-28, starting at step 112-28-1. In step 112-28-2, the program readsthe Cache Management Table 112-14 and searches for the designatedaddress of the virtual volume slot 141-1 or capacity pool stripe 121-1.If there is no cache area for the I/O address, in step 112-28-3, theprogram gets a new cache slot 112-30-1 for the designated address fromthe “Free” or “Clean” queue. If there is a cache area for the I/Oaddress, the program ends at step 112-28-4.

FIG. 15 is an example of a process flow diagram for the ReliabilityManagement Control 112-29-1, starting at step 112-29-1-1. In step112-29-1-2, the process calculates the remaining life of groups (RAIDgroup, thin provisioning group) from the I/O type ratio (by usingSequential Write Counter 112-11-2-6 and Random Write Counter112-11-2-7), the remaining life information of each disk 121, and thestructure of the group (by using the RAID Group Management Table112-11-1). In step 112-29-1-3, the program sends the calculation resultto the storage management terminal 400. The program ends at step112-29-1-4

Sequence of data flow

FIG. 16 shows an example of a sequence chart of the sequential or randomwrite I/O to RAID 1 or 10 volume. At S1000, the host computer 300requests write I/O and sends data to the storage subsystem 100. AtS1001, the storage subsystem 100 receives data from the host computer300. The CPU 111 runs the Write I/O Control 112-21-1 and stores the datato the Cache Data Area 112-30. At S1002, the Cache Data Area 112-30stores data. At S1020, the CPU 111 runs the Flush Control 112-23, findsthe write I/O data, and orders to transfer data from the Cache Data Area112-30 to the disks 121 (disk a and disk b). At S1021, the Cache DataArea 112-30 doubly transfers data to the disks 121 (disk a and disk b).At S1022, the disks 121 receive and store data.

FIG. 17 shows an example of a sequence chart of random write I/O to RAID5 volume. Only the differences as compared to FIG. 16 are described. AtS1010, the CPU 111 orders to transfer the parity data from the disk 121(disk d) to the Cache Data Area 112-30 and generates new parity datafrom the written data and the staged parity data on the Cache Data Area112-30. At S1011, the disk 121 (disk d) transfers data to the Cache DataArea 112-30. At S1012, the Cache Data Area 112-30 receives data from thedisk 121. At S1021′, the Cache Data Area 112-30 transfers data to thedisks 121 (disk a and disk d).

FIG. 18 shows an example of a sequence chart of random write I/O to RAID6 volume. Only the differences as compared to FIG. 17 are described. AtS1010′, the CPU 111 orders to transfer the parity data from the disks121 (disk c and disk d) to the Cache Data Area 112-30 and generates newparity data from the written data and the staged parity data on theCache Data Area 112-30.

FIG. 19 shows an example of a sequence chart of random write I/O to RAID6 volume. Only the differences as compared to FIG. 17 are described. AtS1010″, the CPU 111 generates new parity data from the written data onthe Cache Data Area 112-30 and stores the data to the Cache Data Area112-30. At S1011′, the Cache Data Area 112-30 stores the generatedparity data.

Expression

FIG. 20 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the first embodiment. Theexpression includes a number of variables and suffices. The variableV100 expresses the remaining life of the group. The suffix V101expresses the RAID Level of the calculation target RAID group. Thesuffix V102 expresses the Write I/O type information (sequential orrandom). The variable V103 expresses the remaining life of the group inthe condition under suffices V101 and V102. The variable V104 expressesthe ID of a disk. The variable V105 expresses the number of disks in thegroup. The variable V106 expresses the remaining life of a disk. Thevariable V107 expresses a ratio of the write I/O to the group.

The expression E100 calculates the life of the group in the sequentialand random write I/O mixed environment. The expression E101 calculatesthe life of the group in RAID 10 and the sequential or random write I/Oenvironment. Because RAID 10 writes data doubly, this expressionincludes “divides by 2.” The expression E102 calculates the life of thegroup in RAID 5 and the sequential write I/O environment. Because RAID 5writes (N−1) data and 1 parity data in the sequential write environment,this expression includes “subtracts by 1.” The expression E103calculates the life of the group in RAID 5 and the random write I/Oenvironment. Because RAID 5 writes 1 data and 1 parity data in therandom write environment, this expression includes “divides by 2.” Theexpression E104 calculates the life of the group in RAID 6 and thesequential write I/O environment. Because RAID 6 writes 1 data and 2parity data in the sequential write environment, this expressionincludes “subtracts by 2.” The expression E105 calculates the life ofthe group in RAID 6 and the random write I/O environment. Because RAID 6writes data and 2 parity data in the random write environment, thisexpression includes “divides by 3.”

Output Display

FIG. 21 shows an example of the output image on the display 419. Anadministrator monitors the reliability of the storage subsystem 100. Theaxis 419-10 (x axis) represents time alternation. The axis 419-11 (yaxis) represents the remaining life percentage. The line 419-20represents the remaining life history of the group. The dashed line419-21 represents the remaining life prediction of the group. This lineis calculated by the remaining life history. The event 419-30 points toand shows the current date and remaining life. The event 419-31 pointsto and shows the past disk replacing event

Sequence of System Management

FIG. 22 shows an example of a sequence chart to check the reliabilityand replace a disk according to the first embodiment. At S2000, thestorage management terminal 400 requests to send the group lifeinformation to the storage subsystem 100. At S2001, the CPU 111 asks forthe remaining life from each disk in a certain group and calculates itsremaining life and reports to the storage management terminal 400. AtS2002, the disk 121 sends its own remaining life information to the CPU111. At S2010, the administrator checks the display 419. At S2011, thestorage management terminal shows the remaining life information to thedisplay 419. At S2020, the administrator installs or replaces a new disk121 z to the storage subsystem 100. At S2021, the storage subsystem 100stores the new disk 121 z.

Second Embodiment

Only differences between the second embodiment and the first embodimentare described.

Hardware

FIG. 23 shows an example of a Disk Management Table 112-11-3′ accordingto a second embodiment of the invention. Two values are added to thetable as compared to FIG. 5. The first is the Life Limit Information112-11-3′-3 representing the limit number of write times or operationsto the disk. This value depends on the flash memory chip type (SLC/MLC),vendor, disk model, capacity (reserved capacity), and wear levelingalgorithm. The second is the Life Counter 112-11-3′-4 representing thenumber of write times to the disk.

FIG. 24 shows an example of a process flow diagram for the DestagingControl 112-22-2′ according to the second embodiment. One step is addedto the table as compared to FIG. 12. In step 112-22-2′-9, the processcounts up the Life Counter 112-11-3′-4.

Expression

FIG. 25 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the second embodiment. Twovariables are added and one variable is replaced. The two addedvariables are variable V108′ representing the limit of write number oftimes to the disk and variable V109′ representing the current writenumber of times to the disk. The variable V107 is replaced by thevariable V107′, which defines the parameter with the variable V108′ andvariable V109′.

Sequence of System Management

FIG. 26 shows an example of a sequence chart to check the reliabilityand replace a disk according to the second embodiment. One step isreplaced as compared to FIG. 22. At S2001′ (replacing S2001), the CPU111 calculates the remaining life of RAID groups from the Life LimitInformation 112-11-3′-3 and Life Counter 112-11-3′-4, and reports to thestorage management terminal 400.

Third Embodiment

Only differences between the third embodiment and the first embodimentare described.

Hardware

FIG. 27 shows an example of the memory 112 in the storage subsystemaccording to a third embodiment of the invention. Four elements arereplaced and five elements are added as compared to FIG. 2. Thereplacing elements are the RAID Group Management Table 112-11-1′,Virtual Volume Management Table 112-11-2′, and Destaging Control112-22-2′. The added elements are Virtual Volume Page Management Table112-15-1, Capacity Pool Chunk Management Table 112-15-2, Capacity PoolPage Management Table 112-15-3, Page Migration Control 112-25-1, and themigration control 112-22-3. In the Volume Management Table 112-11, theRAID Group Management Table 112-11-1′ provides physical structuremanagement for the disks 121 and those groups. The Virtual VolumeManagement Table 112-11-2′ provides volume configuration management. Inthe added Thin Provisioning Management Table 112-15, the Virtual VolumePage Management Table 112-15-1 provides reference management from apartition of a virtual volume to a partition of a capacity pool, theCapacity Pool Chunk Management Table 112-15-2 provides resourcemanagement of a capacity pool and reference management from a capacitypool page to a virtual volume page, and the Capacity Pool PageManagement Table 112-15-3 provides resource management of a capacitypool chunk. In the Physical Disk Control 112-22, the Destaging Control112-22-2′ transfers data from the Cache Data Area 112-30 to the disks121 and allocates new pages, and the migration control 112-22-3. In theadded Thin Provisioning Control 112-25, the Page Migration Control112-25-1 migrates one capacity pool page to another capacity pool page.

FIG. 28 shows an example of a RAID Group Management Table 112-11-1′according to the third embodiment. Two values are added to the table ascompared to FIG. 3. The Free Chunk Queue Index 112-11-1-5′ managesunused thin provisioning chunks. The Used Chunk Queue Index 112-11-1-6′manages used thin provisioning chunks.

FIG. 29 shows an example of a Virtual Volume Management Table 112-11-2according to the third embodiment. One value is deleted (Top Address inFIG. 4) and one value is added to the table as compared to FIG. 4. Theadded Using Chunk Number 112-11-2-5′ lists the Chunk ID that the virtualvolume currently uses. The Using RAID Group Number 112-11-2-3′(112-11-2-3 in FIG. 4) lists the RAID Group ID of a chunk that thevirtual volume currently uses.

FIG. 30 shows an example of a Virtual Volume Page Management Table112-15-1. The Virtual Volume Page Index 112-15-1-1 lists the top addressof the virtual volume page. The RAID Group Number 112-15-1-2 lists theRAID Group ID to which the virtual volume page belongs. “N/A” means nocapacity pool page is allocated to the virtual volume page. The CapacityPool Page Index 112-15-1-3 lists the top address of a capacity pool pageto which the virtual volume page refers.

FIG. 31 shows an example of a Capacity Pool Chunk Management Table112-15-2. The Capacity Pool Chunk Number 112-15-2-1 lists the ID of thecapacity pool chunk. The Virtual Volume Number 112-15-2-2 lists the IDof a virtual volume by which the capacity pool chunk is referred. TheUsed Capacity 112-15-2-3 lists the used capacity of the capacity poolchunk. The Deleted Capacity 112-15-2-4 lists the removed capacity of thecapacity pool chunk once the area has used. The Previous Chunk Number112-15-2-5 lists the previous chunk pointer for queue management. TheNext Chunk Number 112-15-2-6 lists the next chunk pointer for queuemanagement. “NULL” means a terminal of the queue.

FIG. 32 shows an example of a Capacity Pool Page Management Table112-15-3. The Capacity Pool Page Index 112-15-1 lists the ID of thecapacity pool page. “N/A” means the capacity pool page is unused. TheVirtual Volume Page Number 112-15-2 lists the ID of a virtual volumepage by which the capacity pool page is referred.

FIG. 33 shows an example of the virtual volume and its table structureaccording to the third embodiment. The arrowed lines include solid linesand dashed lines. A solid line refers to an object refers by pointer. Adashed line refers to an object by calculation. For the virtual volume141, the virtual volume 141 and the Virtual Volume Management Table112-11-2′ are on a one-to-one relation, and the Virtual VolumeManagement Table 112-11-2′ refers to the current using Capacity PoolPages 121-1. For the virtual volume page 141-2, the virtual volume page141-2 and the Virtual Volume Page Management Table 112-15-1 are on aone-to-one relation, and the Virtual Volume Page Table 112-15-1 refersto a slice of Capacity Pool Pages 121-2, if a page is allocated. For theRAID group, the RAID group and RAID Group Management Table 112-11-1′ areon a one-to-one relation, and the RAID Group Management Table 112-11-1′refers to used and unused capacity pool chunks 112-1.

FIG. 34 shows an example of the table reference structure toward thecapacity pool according to the third embodiment. For the arrowed lines,a solid line refers to an object by pointer and a dashed line refers toan object by calculation. For the capacity pool chunk 121-1, thecapacity pool chunk 121-1 and the Capacity Pool Chunk Management Table112-15-2 are on a one-to-one relation, and the Capacity Pool ChunkManagement Table 112-15-2 refers to the virtual volume 141. For thecapacity pool page 121-2, the Capacity Pool Page Management Table112-15-3 refers to virtual volume page 141-2.

FIGS. 35 and 36 show an example of the process flow diagram for theDestaging Control 112-22-2′ according to the third embodiment, startingat step 112-22-2′-1. New steps are added before Destaging Control112-22-2 as compared to the second embodiment of FIG. 24. In step112-22-2′-2, the program checks if a capacity pool page is allocated tothe virtual volume page or not. If yes, in step 112-22-2′-3, the programchecks if the disk(s) to which the capacity pool page belongs reachesthe limit of life or not. If yes, in step 112-22-2′-4, the programallocates a new capacity pool page from a RAID Group which does notreach life limit, and copies from the using capacity pool page to thenewly allocated page. The process continues to the destaging control atstep 112-22-2′-6. If the result is no in step 112-22-2′-3, the processgoes to step 112-22-2′-6. If the result is no in step 112-22-2′-2, instep 112-22-2′-5, the program allocates a new capacity pool page from aRAID group which does not reach life limit. The process then continuesto the destaging control at step 112-22-2′-6.

FIG. 37 shows an example of the process flow diagram for the PageMigration Control 112-25-1, starting at step 112-25-1-1. In step112-25-1-2, the program allocates a new capacity pool page. In step112-25-1-3, the program transfers the designated capacity pool page datafrom the disks and stores the data to the Cache Data Area 112-30. Instep 112-25-1-4, the program copies the capacity pool page data to thenewly allocated capacity pool page. In step 112-25-1-5, the programchanges the reference of RAID Group Number 112-15-1-2 and Capacity PoolPage Index 112-15-1-3 to the newly added page, and releases the old(migrated) capacity pool page. The process ends at step 112-22-1-6.

Expression

FIG. 38 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 of FIG. 15 according to the third embodiment. Thisexpression is based on the first embodiment of FIG. 20. The variableV200 expresses the remaining life of the thin provisioning pool. Thevariable

V201 expresses the remaining life (i.e., write I/O endurance) E_(j) ofthe jth RAID group which is a member of the thin provisioning pool inthe sequential and random write I/O mixed environment. The remaininglife E_(j) of the jth RAID group is calculated using the formulasdescribed above (FIGS. 20 and 25). The variable V202 expresses the ID ofa RAID group. The variable V203 expresses the number of RAID groups inthe thin provisioning pool. The expression E200 calculates the life ofthe thin provisioning pool which includes a plurality of RAID groups.

Fourth Embodiment

Only differences between the fourth embodiment and the third embodimentare described.

FIG. 39 shows an example of the memory 112 in the storage subsystemaccording to a fourth embodiment of the invention. Three elements arereplaced and one element (Migration Control 112-22-3) is deleted ascompared to FIG. 27. The three new elements replacing the old areVirtual Volume Management Table 112-11-2″, Disk Management Table112-11-3″, and Virtual Volume Page Management Table 112-15-1″.

FIG. 40 shows an example of a Disk Management Table 112-11-3″ accordingto the fourth embodiment. Two values are added to the table as comparedto FIG. 5. The first is the Free Chunk Queue Index 112-11-3-5″ formanaging unused thin provisioning chunks. The second is the Used ChunkQueue Index 112-11-3-6″ for managing used thin provisioning chunks.

FIG. 41 shows an example of a Virtual Volume Management Table 112-11-2″according to the fourth embodiment. As compared to FIG. 4, the DiskNumber 112-11-2-3″ in FIG. 41 provides the ID list of disks 121 that thevirtual volume currently uses, and the Chunk Number 112-11-2-5″ providesthe ID list of capacity pool chunks belonging to a capacity pool thatthe virtual volume currently uses.

FIG. 42 shows an example of a Virtual Volume Page Management Table112-15-1″ according to the fourth embodiment. As compared to FIG. 30,the Disk Number 112-15-1-2″ in FIG. 42 provides the ID list of disks 121belonging to a capacity pool page to which the virtual volume pagerefers, the Capacity Pool Page 112-15-1-3″ provides the ID list ofaddress belonging to a capacity pool page to which the virtual volumepage refers.

FIG. 43 shows an example of the virtual volume and its table structureaccording to the fourth embodiment. A solid arrowed line refers to anobject by pointer. A dashed arrowed line refers to an object bycalculation. For the virtual volume 141, the virtual volume 141 and theVirtual Volume Management Table 112-11-2′ are on a one-to-one relation,and the Virtual Volume Management Table 112-11-2′ refers to the currentusing Capacity Pool Pages 121-1. For the virtual volume page 141-2, thevirtual volume page 141-2 and the Virtual Volume Page Management Table112-15-1 are on a one-to-one relation, and the Virtual Volume Page Table112-15-1 refers to two (or more) slices of Capacity Pool Pages 121-2, ifpages are allocated. The disks 121 and Disk Management Table 112-11-3″are on a one-to-one relation. The Disk Management Table 112-11-3″ refersto used and unused Capacity Pool Chunks 112-1.

FIG. 44 shows an example of the table reference structure toward thecapacity pool according to the fourth embodiment. For the arrowed lines,a solid line refers to an object by pointer and a dashed line refers toan object by calculation. For the capacity pool chunk 121-1, thecapacity pool chunk 121-1 and the Capacity Pool Chunk Management Table112-15-2 are on a one-to-one relation, and the Capacity Pool ChunkManagement Table 112-15-2 refers to the virtual volume 141. For thecapacity pool page 121-2, the Capacity Pool Page Management Table112-15-3 refers to virtual volume page 141-2.

Expression

FIG. 45 shows an example of an expression to calculate the reliabilityat step 112-29-1-2 according to the fourth embodiment. The variable V212expresses the ID of a disk. The variable V213 expresses the number ofdisks in the thin provisioning pool. The expression E210 calculates thelife of the thin provisioning pool which includes a plurality of disks.In this case, the expression does not depend on the ratio of sequentialto random write I/O types since it is for a RAID10 life.

Of course, the system configurations illustrated in FIGS. 1, 2, 27, and39 are purely exemplary of information systems in which the presentinvention may be implemented, and the invention is not limited to aparticular hardware configuration. The computers and storage systemsimplementing the invention can also have known I/O devices (e.g., CD andDVD drives, floppy disk drives, hard drives, etc.) which can store andread the modules, programs and data structures used to implement theabove-described invention. These modules, programs and data structurescan be encoded on such computer-readable media. For example, the datastructures of the invention can be stored on computer-readable mediaindependently of one or more computer-readable media on which reside theprograms used in the invention. The components of the system can beinterconnected by any form or medium of digital data communication,e.g., a communication network. Examples of communication networksinclude local area networks, wide area networks, e.g., the Internet,wireless networks, storage area networks, and the like.

In the description, numerous details are set forth for purposes ofexplanation in order to provide a thorough understanding of the presentinvention. However, it will be apparent to one skilled in the art thatnot all of these specific details are required in order to practice thepresent invention. It is also noted that the invention may be describedas a process, which is usually depicted as a flowchart, a flow diagram,a structure diagram, or a block diagram. Although a flowchart maydescribe the operations as a sequential process, many of the operationscan be performed in parallel or concurrently. In addition, the order ofthe operations may be re-arranged.

As is known in the art, the operations described above can be performedby hardware, software, or some combination of software and hardware.Various aspects of embodiments of the invention may be implemented usingcircuits and logic devices (hardware), while other aspects may beimplemented using instructions stored on a machine-readable medium(software), which if executed by a processor, would cause the processorto perform a method to carry out embodiments of the invention.Furthermore, some embodiments of the invention may be performed solelyin hardware, whereas other embodiments may be performed solely insoftware. Moreover, the various functions described can be performed ina single unit, or can be spread across a number of components in anynumber of ways. When performed by software, the methods may be executedby a processor, such as a general purpose computer, based oninstructions stored on a computer-readable medium. If desired, theinstructions can be stored on the medium in a compressed and/orencrypted format.

From the foregoing, it will be apparent that the invention providesmethods, apparatuses and programs stored on computer readable media forthe management of availability and reliability of flash memory media.Additionally, while specific embodiments have been illustrated anddescribed in this specification, those of ordinary skill in the artappreciate that any arrangement that is calculated to achieve the samepurpose may be substituted for the specific embodiments disclosed. Thisdisclosure is intended to cover any and all adaptations or variations ofthe present invention, and it is to be understood that the terms used inthe following claims should not be construed to limit the invention tothe specific embodiments disclosed in the specification. Rather, thescope of the invention is to be determined entirely by the followingclaims, which are to be construed in accordance with the establisheddoctrines of claim interpretation, along with the full range ofequivalents to which such claims are entitled.

1. A method of evaluating reliability of flash memory media, the methodcomprising: managing a flash memory remaining life for each disk of aplurality of flash memory media disks provided in one or more flashmemory media groups each of which has a configuration and a relationshipbetween said each flash memory media group and the flash memory mediadisks in said each flash memory media group, wherein each flash memorymedia group is one of a RAID group or a thin provisioning pool; andcalculating to obtain information of each flash memory media group basedon the flash memory remaining life for each disk in said each flashmemory media group, the configuration of said each flash memory mediagroup, and the relationship between said each flash memory media groupand the flash memory media disks in said each flash memory media group.2. A method according to claim 1, further comprising: outputting thecalculated information of each flash memory media group, includingreplacement of a disk in said each flash memory media group and showingeffect of the replacement on the calculated information.
 3. A methodaccording to claim 2, wherein outputting the calculated informationcomprises outputting a remaining life of each flash memory media group,including showing the effect of the replacement of a disk in said eachflash memory media group on the remaining life of said each flash memorymedia group.
 4. A method according to claim 1, wherein managing theflash memory remaining life for a disk comprises obtaining the flashmemory remaining life based on an amount of sequential write I/O andrandom I/O of the disk.
 5. A method according to claim 1, furthercomprising: calculating an evaluation of random write I/O of each flashmemory media group based on the configuration of said each flash memorymedia group and the relationship between said each flash memory mediagroup and the flash memory media disks in said each flash memory mediagroup.
 6. A method according to claim 1, further comprising: calculatingan evaluation of sequential write I/O of each flash memory media groupbased on the configuration of said each flash memory media group and therelationship between said each flash memory media group and the flashmemory media disks in said each flash memory media group.
 7. A system ofevaluating reliability of flash memory media, the system comprising: aplurality of flash memory media disks which are provided in one or moreflash memory media groups each of which has a configuration and arelationship between said each flash memory media group and the flashmemory media disks in said each flash memory media group, wherein eachflash memory media group is one of a RAID group or a thin provisioningpool; a memory storing data and one or more modules; a processorexecuting the one or more modules to manage a flash memory remaininglife for each disk of the plurality of flash memory media disks; andcalculate to obtain information of each flash memory media group basedon the flash memory remaining life for each disk in said each flashmemory media group, the configuration of said each flash memory mediagroup, and the relationship between said each flash memory media groupand the flash memory media disks in said each flash memory media group.8. A system according to claim 7, wherein the processor is configured toexecute the one or more modules to: output the calculated information ofeach flash memory media group, including replacement of a disk in saideach flash memory media group and showing effect of the replacement onthe calculated information.
 9. A system according to claim 8, whereinoutputting the calculated information comprises outputting a remaininglife of each flash memory media group, including showing the effect ofthe replacement of a disk in said each flash memory media group on theremaining life of said each flash memory media group.
 10. A systemaccording to claim 7, wherein managing the flash memory remaining lifefor a disk comprises obtaining the flash memory remaining life based onan amount of sequential write I/O and random I/O of the disk.
 11. Asystem according to claim 7, wherein the processor is configured toexecute the one or more modules to: calculate an evaluation of randomwrite I/O of each flash memory media group based on the configuration ofsaid each flash memory media group and the relationship between saideach flash memory media group and the flash memory media disks in saideach flash memory media group.
 12. A system according to claim 7,wherein the processor is configured to execute the one or more modulesto: calculate an evaluation of sequential write I/O of each flash memorymedia group based on the configuration of said each flash memory mediagroup and the relationship between said each flash memory media groupand the flash memory media disks in said each flash memory media group.13. A computer-readable storage medium storing a plurality ofinstructions for controlling a data processor to evaluate reliability offlash memory media, the plurality of instructions comprising:instructions that cause the data processor to manage a flash memoryremaining life for each disk of a plurality of flash memory media disksprovided in one or more flash memory media groups each of which has aconfiguration and a relationship between said each flash memory mediagroup and the flash memory media disks in said each flash memory mediagroup, wherein each flash memory media group is one of a RAID group or athin provisioning pool; and instructions that cause the data processorto calculate to obtain information of each flash memory media groupbased on the flash memory remaining life for each disk in said eachflash memory media group, the configuration of said each flash memorymedia group, and the relationship between said each flash memory mediagroup and the flash memory media disks in said each flash memory mediagroup.
 14. A computer-readable storage medium according to claim 13,wherein the plurality of instructions further comprise: instructionsthat cause the data processor to output the calculated information ofeach flash memory media group, including replacement of a disk in saideach flash memory media group and showing effect of the replacement onthe calculated information.
 15. A computer-readable storage mediumaccording to claim 14, wherein outputting the calculated informationcomprises outputting a remaining life of each flash memory media group,including showing the effect of the replacement of a disk in said eachflash memory media group on the remaining life of said each flash memorymedia group.
 16. A computer-readable storage medium according to claim13, wherein managing the flash memory remaining life for a diskcomprises obtaining the flash memory remaining life based on an amountof sequential write I/O and random I/O of the disk.
 17. Acomputer-readable storage medium according to claim 13, wherein theplurality of instructions further comprise: instructions that cause thedata processor to calculate an evaluation of random write I/O of eachflash memory media group based on the configuration of said each flashmemory media group and the relationship between said each flash memorymedia group and the flash memory media disks in said each flash memorymedia group.
 18. A computer-readable storage medium according to claim13, wherein the plurality of instructions further comprise: instructionsthat cause the data processor to calculate an evaluation of sequentialwrite I/O of each flash memory media group based on the configuration ofsaid each flash memory media group and the relationship between saideach flash memory media group and the flash memory media disks in saideach flash memory media group.